Polygon Inflation for Animated Models: a Method for the Extrusion of Arbitrary Polygon Meshes
نویسندگان
چکیده
A method for the extrusion of arbitrary polygon meshes is introduced. This method can be applied to model a large class of complex 3-D closed surfaces. It consists of defining a (typically small) set of connected polygons in 3-D that form a skeleton of the final object, and assigning extrusion distances to all polygons. Both sides of a polygon may have different extrusion distances. An automatic extrusion algorithm constructs a closed 3-D polygon mesh around the skeleton making use of the indicated extrusion distances. We call this process inflating the polygons of the skeleton. Unlike traditional extrusion, the method works for non-planar skeleton configurations, and it also supports branching skeleton structures (i.e. edges with >2 incident polygons).
منابع مشابه
A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملGeneration of Volume Meshes by Extrusion from Surface Meshes of Arbitrary Topology
An algorithm to generate volume meshes by extrusion from surface meshes of arbitrary topology is presented. The algorithm utilizes a three-step, advancing layer scheme to extrude a smooth volume mesh starting from an initial surface mesh. First, a locally orthogonal reference mesh is algebraically generated for the layer. The reference mesh is then smoothed using a locally three-dimensional Poi...
متن کاملGeneration of Generalized Meshes by Extrusion from Surface Meshes of Arbitrary Topology
A novel algorithm to extrude smooth, near-body volume meshes from surface meshes of arbitrary topology is presented. These meshes are classified as generalized meshes because multiple element topologies may be present within the same mesh. The algorithm utilizes a three-step, parabolic scheme based on the Poisson equation used in structured grid generation to extrude the volume mesh. Several pr...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملHybrid Coding for Animated Polygonal Meshes
A new hybrid coding method for compressing animated polygonal meshes is presented. This paper assumes the simplistic representation of the geometric data: a temporal sequence of polygonal meshes for each discrete frame of the animated sequence. The method utilizes a delta coding and an octree-based method. In this hybrid method, both the octree approach and the delta coding approach are applied...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Visualization and Computer Animation
دوره 8 شماره
صفحات -
تاریخ انتشار 1997